package Lee_code;

import java.util.Deque;
import java.util.LinkedList;

public class Lee_130 {
    int row, column;
    boolean[][] seen;
    public void solve(char[][] board) {
        row = board.length;
        column = board[0].length;
        for(int i=0; i<row; i++)
        {
            for(int j=0; j<column; j++)
            {
                bfs(i, j, board);
            }
        }



    }

    private void bfs(int i, int j, char[][] board)
    {
        Deque<int[]> deque = new LinkedList<>();
        deque.offer(new int[] {i, j});
        seen[i][j] = true;
        while(!deque.isEmpty())
        {
            int[] cur = deque.poll();
            int m = cur[0];
            int n = cur[1];

        }

    }
}
